A new quantum lower bound method, with an application to strong direct product theorem for quantum search

نویسنده

  • Andris Ambainis
چکیده

We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of adversary method, by analyzing the eigenspace structure of the problem. Using the new method, we prove a strong direct product theorem for quantum search. This result was previously proven by Klauck, Špalek and de Wolf (quant-ph/0402123) using polynomials method. No proof using adversary method was known before.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search

We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structure of the problem. Using the new method, we prove a strong direct product theorem for quantum search. This result was previously proved by Klauck, Špalek, and de Wolf (FOCS’04) using the polynomials method. No proof using the ad...

متن کامل

A strong direct product theorem in terms of the smooth rectangle bound

A strong direct product theorem states that, in order to solve k instances of a problem, if we provide less than k times the resource required to compute one instance, then the probability of overall success is exponentially small in k. In this paper, we consider the model of two-way public-coin communication complexity and show a strong direct product theorem for all relations in terms of the ...

متن کامل

A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound

The main result of this paper is an optimal strong direct product result for the two-party public-coin randomiz ed communication complexity of the Tribes function. This is proved by providing an alternate proof of the optimal lower bound of Ω(n) for the randomised communication complexity of the Tribes function using the so-called smooth-rectangle bound, introduced by Jain and Klauck [JK10]. Th...

متن کامل

Individual ergodic theorem for intuitionistic fuzzy observables using intuitionistic fuzzy state

The classical ergodic theory hasbeen built on σ-algebras. Later the Individual ergodictheorem was studied on more general structures like MV-algebrasand quantum structures. The aim of this paper is to formulate theIndividual ergodic theorem for intuitionistic fuzzy observablesusing  m-almost everywhere convergence, where  m...

متن کامل

Optimized Design of Multiplexor by Quantum-dot CellularAutomata

Quantum-dot Cellular Automata (QCA) has low power consumption and high density and regularity. QCA widely supports the new devices designed for nanotechnology. Application of QCA technology as an alternative method for CMOS technology on nano-scale shows a promising future. This paper presents successful designing, layout and analysis of Multiplexer with a new structure in QCA technique. In thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/quant-ph/0508200  شماره 

صفحات  -

تاریخ انتشار 2005